- combinatorial identity
- мат.комбинаторное тождество
English-Russian scientific dictionary. 2008.
combinatorial identity
Смотреть что такое "combinatorial identity" в других словарях:
Combinatorial proof — In mathematics, the term combinatorial proof is often used to mean either of two types of proof of an identity in enumerative combinatorics that either states that two sets of combinatorial configurations, depending on one or more parameters,… … Wikipedia
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
A curious identity involving binomial coefficients — In combinatorics, a curious identity by Sun is the following combinatorial identity involving binomial coefficients first established by Zhi Wei Sun in 2002::(x+m+1)sum {i=0}^m( 1)^idbinom{x+y+i}{m i}dbinom{y+2i}{i} sum {i=0}^{m}dbinom{x+i}{m i}( … Wikipedia
Vandermonde's identity — For the expression for a special determinant, see Vandermonde matrix. In combinatorics, Vandermonde s identity, or Vandermonde s convolution, named after Alexandre Théophile Vandermonde (1772), states that for binomial coefficients. This identity … Wikipedia
Dixon's identity — In mathematics, Dixon s identity (or Dixon s theorem or Dixon s formula) is any of several different but closely related identities proved by A. C. Dixon, some involving finite sums of products of three binomial coefficients, and some evaluating… … Wikipedia
Pascal's rule — In mathematics, Pascal s rule is a combinatorial identity about binomial coefficients. It states that for any natural number n we have:{n 1choose k} + {n 1choose k 1} = {nchoose k} where 1 leq k < n and {nchoose k} is a binomial… … Wikipedia
Matching polynomial — In graph theory and combinatorics, both fields within mathematics, a matching polynomial (sometimes called an acyclic polynomial) is a generating function of the numbers of matchings of various sizes in a graph. Contents 1 Definition 2… … Wikipedia
Indian mathematics — mdash;which here is the mathematics that emerged in South Asia from ancient times until the end of the 18th century mdash;had its beginnings in the Bronze Age Indus Valley civilization (2600 1900 BCE) and the Iron Age Vedic culture (1500 500 BCE) … Wikipedia
Robinson-Schensted algorithm — In mathematics, the Robinson ndash;Schensted algorithm is a combinatorial algorithm, first described by Robinson in 1938, which establishes a bijective correspondence between elements of the symmetric group S n and pairs of standard Young… … Wikipedia
Binomial coefficient — The binomial coefficients can be arranged to form Pascal s triangle. In mathematics, binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. They are indexed by two nonnegative integers; the… … Wikipedia
DNA-encoded chemical library — DNA encoded chemical libraries (DEL) are a new technology for the synthesis and screening of collections of chemical compounds of unprecedented size and quality. DEL represents an advance in medicinal chemistry which bridges the fields of… … Wikipedia
